#include<bits/stdc++.h>
using namespace std;
typedef long long van;
template<typename T> inline
void read(T& x) {
    T f = 1, b = 0; char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-') f = -1;
        ch = getchar();
    } while (isdigit(ch))
        b *= 10, b += ch - '0', ch = getchar();
    x = f * b; return;
}
template<typename T> inline
void print(T x) {
    if (x == 0) return putchar('0'), void();
    if (x < 0) putchar('-'), x = -x;
    int st[129] = {0}, k = 0;
    while (x) st[++k] = x % 10, x /= 10;
    for (int i = k; i; i--) putchar(st[i] + '0');
} const van MaxN = 2e5 + 10;
van n, a[MaxN], q;
van dp[MaxN][2]; // 到达i且上一轮为j
// void DP() {
//     for (int i = 1; i <= n + 1; i++) dp[i][1] = 1e18, dp[i][0] = -1e18;
//     dp[1][1] = a[1];
//     for (int i = 1; i < n; i++) {
//         for (int now = 0; now < 2; now++) {
//             if (abs(dp[i][now]) == 1e18) continue;
//             van tmp = 0;
//             for (int j = i + 1; j <= n; j++) {
//                 tmp += a[j];
//                 if (now == 1) dp[j][0] = max(dp[j][0], dp[i][1] - tmp);
//                 else dp[j][1] = min(dp[j][1], dp[i][0] + tmp);
//             }
//         }
//     }
//     for (int i = 1; i <= n; i++) cout << dp[i][0] << " " << dp[i][1] << endl;
// }
int main() {
    freopen("pockets.in", "r", stdin);
    freopen("pockets.out", "w", stdout);
    read(n);
    for (int i = 1; i < n; i++) read(a[i]);
    read(q); van midsum = 0;
    for (int i = 2; i < n; i++) midsum += a[i];
    for (int i = 1; i <= q; i++) {
        read(a[n]);
        van ans = a[1] + a[n];
        print(ans - midsum), putchar('\n');
    }
}